How to play (3×3)-games.: A strategy method experiment

نویسندگان

  • Reinhard Selten
  • Klaus Abbink
  • Joachim Buchta
  • Abdolkarim Sadrieh
چکیده

Using the strategy method (Selten 1967) we elicit subjects' strategies for playing any 2-person 3x3-game with integer payoffs between 0 and 99. In each of 5 tournaments, every strategy pair plays 500000 games. The frequency of pure strategy equilibrium play increases from 51% in the first to 74% in the last tournament, with the equilibria that maximize joint payoff being preferred when multiple exist. For games without pure equilibria, strategies are typically based on elements of the best-reply cascade: MAP (maximize the expected payoff against uniformly randomizing opponents), BR-MAP (best reply to MAP), and BR-BR-MAP (best reply to BR-MAP).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Play 3x3-Games A Strategy Method Experiment

We report an experiment that uses the strategy method (Selten 1967) to elicit subjects' general strategy for playing any 2-person 3x3-game with integer payoffs between 0 and 99. Each two subjects' strategies play 500000 games in each of the 5 tournaments. For games with pure strategy equilibria (ca. 80%), the frequency of pure strategy equilibrium play increases from 51% in the first to 74% in ...

متن کامل

بازی‌های جدی در آموزش پزشکی: چرایی، چیستی، چگونگی

Introduction: Use of appropriate teaching-learning strategies play a unique role in improving the learning process of medical students. This research aims to investigate what, why and how serious games affect teaching methods. Methods: This review paper extracted papers published on serious game conception, medical education, serious gaming applications, universities experiences, and serious g...

متن کامل

How do people play against Nash opponents in games which have a mixed strategy equilibrium?

We examine experimentally how humans behave when they, unbeknownst to them, play against a computer which implements its part of a mixed strategy Nash equilibrium. We consider two games, one zero-sum and another unprofitable with a pure minimax strategy. A minority of subjects’ play was consistent with their Nash equilibrium strategy. But a larger percentage of subjects’ play was more consisten...

متن کامل

Games with Communication: From Belief to Preference Change

In this work we consider simple extensive-form games with two players, Player A and Player B, where Player B can make announcements about his strategy. Player A has then to revise her preferences about her strategies, so as to better respond to the strategy she believes Player B will play. We propose a generic framework that combines methods and techniques from belief revision theory and social...

متن کامل

Computing Game Values for Crash Games

We consider crash games which are a generalization of parity games in which the play value of a play is an integer, −∞ or ∞. In particular, the play value of a finite play is given as the sum of the payoffs of the moves of the play. Accordingly, one player aims at maximizing the play value whereas the other player aims at minimizing this value. We show that the game value of such a crash game a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2003